edge only造句

• Consider the random subgraph of t containing the vertex set z and the open edges only . the connected components of this graph are called open cluter . usually , we write it in the short term c . some people say that " percolation occurs ' when there exists an infinite open cluster
  在树t中，用开路互相连通的点形成一个开串( cluster ) ，我们记| c |为包含原点o的开串c中的点的个数，若事件{ | c | = o }发生，我们就说渗流发生。